public class MyBinaryTree {
    class treeNode{
        char val;
        treeNode left;
        treeNode right;
        public treeNode(char val){
            this.val = val;
        }
    }
    public treeNode root;

    // 获取树中节点的个数
    public int size(treeNode root){

    }
    // 获取叶子节点的个数
    int getLeafNodeCount(treeNode root){

    }
    // 获取第K层节点的个数
    int getKLevelNodeCount(treeNode root,int k){}

    // 获取二叉树的高度
    int getHeight(treeNode root){
        if(root == null){
            return 0;
        }
        int lefthight = getHeight(root.left);
        int righthight = getHeight(root.right);
        return ((lefthight>righthight)?righthight:lefthight) +1;
    }
    // 检测值为value的元素是否存在
    treeNode find(treeNode root, int val){}
    // 层序遍历
    void levelOrder(treeNode root){}
    // 判断一棵树是不是完全二叉树
    boolean isCompleteTree(treeNode root){}
}
